Reasoning With Scene Graphs for Robot Planning Under Partial Observability
نویسندگان
چکیده
Robot planning in partially observable domains is difficult, because a robot needs to estimate the current state and plan actions at same time. When domain includes many objects, reasoning about objects their relationships makes even more difficult. In this letter, we develop an algorithm called scene analysis for planning (SARP) that enables robots reason with visual contextual information toward achieving long-term goals under uncertainty. SARP constructs scene graphs, factored representation of relations, using images captured from different positions, reasons them enable context-aware partial observability. Experiments have been conducted multiple 3D environments simulation, dataset collected by real robot. comparison standard methods, target search domain, improves both efficiency accuracy task completion.
منابع مشابه
Strong planning under partial observability
Rarely planning domains are fully observable. For this reason, the ability to deal with partial observability is one of the most important challenges in planning. In this paper, we tackle the problem of strong planning under partial observability in nondeterministic domains: find a conditional plan that will result in a successful state, regardless of multiple initial states, nondeterministic a...
متن کاملA Logic for Planning under Partial Observability
We propose an epistemic dynamic logic EDL able to represent the interactions between action and knowledge that are fundamental to planning under partial observability. EDL enables us to represent incomplete knowledge, nondeterministic actions, observations, sensing actions and conditional plans; it also enables a logical expression of several frequently made assumptions about the nature of the ...
متن کاملA Framework for Planning with Extended Goals under Partial Observability
Planning in nondeterministic domains with temporally extended goals under partial observability is one of the most challenging problems in planning. Subsets of this problem have been already addressed in the literature. For instance, planning for extended goals has been developed under the simplifying hypothesis of full observability. And the problem of a partial observability has been tackled ...
متن کاملHeuristics for Planning under Partial Observability with Sensing Actions
In planning under partial observability with sensing actions (PPOS) problems, the solution progresses from one sensing action to another, until sufficient information is gathered and the goal can be reached. In between sensing actions, one can use classical planning to derive the path to the next sensing action. We suggest an online algorithm that repeatedly selects the next sensing action to e...
متن کاملTowards Strong Cyclic Planning under Partial Observability
Strong Cyclic Planning aims at generating iterative plans that only allow loops so far as there is a chance to reach the goal. The problem is already significantly complex for fully observable domains; when considering partially observable domains, even providing a formal definition is far from straightforward. In this work, we provide a formal definition of Strong Cyclic Planning under Partial...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE robotics and automation letters
سال: 2022
ISSN: ['2377-3766']
DOI: https://doi.org/10.1109/lra.2022.3157567